On computable isomorphisms in efficient asymmetric pairing-based systems
نویسندگان
چکیده
In this paper we examine the hard problems underlying asymmetric pairings, their precise relationships and how they affect a number of existing protocols. Furthermore, we present a new model for the elliptic curve groups used in asymmetric pairings, which allows both an efficient pairing and an efficiently computable isomorphism.
منابع مشابه
On Computable Isomorphisms in Efficient Pairing Based Systems
In this paper we examine the underlying hard problems in asymmetric pairings, their precise relationships and how they affect a number of existing protocols. Furthermore, we present a new model for the elliptic curve groups used in asymmetric pairings, which allows both an efficient pairing and an efficient computable isomorphism.
متن کاملGeneralizations of Verheul's theorem to asymmetric pairings
For symmetric pairings e : G × G → GT , Verheul proved that the existence of an efficiently-computable isomorphism φ : GT → G implies that the Diffie-Hellman problems in G and GT can be efficiently solved. In this paper, we explore the implications of the existence of efficiently-computable isomorphisms φ1 : GT → G1 and φ2 : GT → G2 for asymmetric pairings e : G1 ×G2 → GT . We also give a simpl...
متن کاملTwo Constructions of Multireceiver Encryption Supporting Constant Keys, Short Ciphertexts, and Identity Privacy
Multireceiver encryption enables a sender to encrypt a message and transmit the ciphertext to a set of authorized users while no one outside this set can decrypt the message, which is known as an efficient protocol to achieve a secure multicast data communication among multiple authorized users. In this work, we construct two identitybased multireceiver encryption schemes (one is based on compo...
متن کاملPairing Computation on Elliptic Curves with Efficiently Computable Endomorphism and Small Embedding Degree
Scott uses an efficiently computable isomorphism in order to optimize pairing computation on a particular class of curves with embedding degree 2. He points out that pairing implementation becomes thus faster on these curves than on their supersingular equivalent, originally recommended by Boneh and Franklin for Identity Based Encryption. We extend Scott’s method to other classes of curves with...
متن کاملCockpit Crew Pairing Problem in Airline Scheduling: Shortest Path with Resources Constraints Approach
Increasing competition in the air transport market has intensified active airlines’ efforts to keep their market share by attaching due importance to cost management aimed at reduced final prices. Crew costs are second only to fuel costs on the cost list of airline companies. So, this paper attempts to investigate the cockpit crew pairing problem. The set partitioning problem has been used for ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete Applied Mathematics
دوره 155 شماره
صفحات -
تاریخ انتشار 2005